Adaptive Galerkin boundary element methods with panel clustering

In this paper, we will propose a boundary element method for solving classical boundary integral equations on complicated surfaces which, possibly, contain a large number of geometric details or even uncertainties in the given data. The (small) size of such details is characterised by a small parameter and the regularity of the solution is expected to be low in such zones on the surface (which we call the wire-basket zones). We will propose the construction of an initial discretisation for such type of problems. Afterwards standard strategies for boundary element discretisations can be applied such as the h, p, and the adaptive hp-version in a straightforward way. For the classical boundary integral equations, we will prove the optimal approximation results of our so-called wire-basket boundary element method and discuss the stability aspects. Then, we construct the panel-clustering and -matrix approximations to the corresponding Galerkin BEM stiffness matrix. The method is shown to have an almost linear complexity with respect to the number of degrees of freedom located on the wire basket. DOI: https://doi.org/10.1007/s00211-006-0047-9 Posted at the Zurich Open Repository and Archive, University of Zurich ZORA URL: https://doi.org/10.5167/uzh-21550 Accepted Version Originally published at: Hackbusch, W; Khoromskij, B; Sauter, S (2007). Adaptive Galerkin boundary element methods with panel clustering. Numerische Mathematik, 105(4):603-631. DOI: https://doi.org/10.1007/s00211-006-0047-9 Adaptive Galerkin Boundary Element Methods with Panel Clustering Wolfgang Hackbusch, Boris N. Khoromskij and Stefan Sauter November 3, 2004 Abstract The present paper introduces an hp-version of BEM for the Laplace equation in polyhedral domains based on meshes which are concentrated to zones on the surface (wire-basket zones), where the regularity of the solution is expected to be low. For the classical boundary integral equations, we prove the optimal approximation results and discuss the stability aspects. Then, we construct the panel-clustering and H-matrix approximations to the corresponding Galerkin BEM stiffness matrix and prove their linear-logarithmic cost. The method is shown to have an almost linear complexity with respect to the number of degrees of freedom located on the wire basket.The present paper introduces an hp-version of BEM for the Laplace equation in polyhedral domains based on meshes which are concentrated to zones on the surface (wire-basket zones), where the regularity of the solution is expected to be low. For the classical boundary integral equations, we prove the optimal approximation results and discuss the stability aspects. Then, we construct the panel-clustering and H-matrix approximations to the corresponding Galerkin BEM stiffness matrix and prove their linear-logarithmic cost. The method is shown to have an almost linear complexity with respect to the number of degrees of freedom located on the wire basket. AMS Subject Classification: 65F50, 65F30